Frame-bound priority scheduling in discrete-time queueing systems
نویسندگان
چکیده
منابع مشابه
Frame-bound Priority Scheduling in Discrete-time Queueing Systems
A well-known problem with priority policies is starvation of delaytolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discretetime queueing system with...
متن کاملPerformance Analysis of Priority Queueing Systems in Discrete Time
The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-prior...
متن کاملQueue Content Analysis in a 2-Class Discrete-Time Queueing System under the Slot-Bound Priority Service Rule
The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It is a milder form of priority when compared to HoL priority, but it favors customers of one type over the other when compared to regular FCFS. It also provides an answer to the starvation problem that occurs in HoL priority systems. In this new priority mechanism, customers of different priority c...
متن کاملScheduling slack time in fixed priority pre-emptive systems
This report addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or sporadic tasks, without jeopardising their timing constraints. It extends to tasks with characteri...
متن کاملUsing Fixed Priority Pre-emptive Scheduling in Real-Time Systems
For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in the literature, starting from static scheduling or cyclic executives which provide very deterministic yet inflexible behaviour, to the so called best-effort scheduling, which facilitates maximum run-time flexibility but allows only probabilistic predictions of run-tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2011
ISSN: 1547-5816
DOI: 10.3934/jimo.2011.7.765